Deterministic Scheduling in Computer Systems: a Survey

The progress of computer architecture has increased the necessity to design efficient scheduling algorithms according to the types of computer systems. We survey recent results of optimization and approximation algorithms for deterministic models of computer scheduling. We deal with identical, uniform and unrelated parallel processor systems, and flowshop systems. Optimality criteria considered in this paper are schedule-length and mean (weighted) flow-time. These are important measures for evaluating schedules in computer systems. Results on practical algorithms such as list scheduling are emphasized.